Image Segmentation using SLIC Superpixels and Affinity Propagation Clustering
نویسنده
چکیده
In this paper, we propose a new method of image segmentation, named SLICAP, which combines the simple linear iterative clustering (SLIC) method with the affinity propagation (AP) clustering algorithm. First, the SLICAP technique uses the SLIC superpixel algorithm to form an over-segmentation of an image. Then, a similarity is constructed based on the features of superpixels. Finally, the AP algorithm clusters these superpixels with the similarities obtained. We compose three similarities attempt to find the most suitable one for SLICAP. Compared with the standard Ncuts method for image segmentation, the unsupervised SLICAP approach is relatively simple and fast, and there is no need to determine the number of targets. The experiments on the Berkeley segmentation database show that the image segmentation results produced by the SLICAP method are well consistent with the human visual perception. Quantitively, the SLICAP method outperforms other classical segmentation algorithms with the boundary-based and region-based criteria, including F-measure, probabilistic rand index, variation of information and boundary displacement error.
منابع مشابه
Segmentation Improvement of High Resolution Remote Sensing Images based on superpixels using Edge-based SLIC algorithm (E-SLIC)
The segmentation of high resolution remote sensing images is one of the most important analyses that play a significant role in the maximal and exact extraction of information. There are different types of segmentation methods among which using superpixels is one of the most important ones. Several methods have been proposed for extracting superpixels. Among the most successful ones, we can r...
متن کاملSuperpixels Generating from the Pixel-based K-Means Clustering
Image segmentation is a basic but important preprocessing to image recognition in computer vision applications. In this paper, we propose a pixel-based k-means (PKM) clustering to generate superpixels, which comprise many pixels with similar colors and neighbor positions. In contrast with conventional center-based clustering, the PKM method traces several nearer clustering centers for a pixel i...
متن کاملPeekaboo - Where are the Objects? Structure Adjusting Superpixels
This paper addresses the search for a fast and meaningful image segmentation in the context of k-means clustering. The proposed method builds on a widely-used local version of Lloyd’s algorithm, called Simple Linear Iterative Clustering (SLIC). We propose an algorithm which extends SLIC to dynamically adjust the local search, adopting superpixel resolution dynamically to structure existent in t...
متن کاملSaliency Detection in Aerial Imagery Using Multi-Scale SLIC Segmentation
Object detection in a huge volume of aerial imagery requires first detecting the salient regions. When an image is over-segmented by the superpixels, the latters will adhere to object boundaries, resulting in their shape deformation and size variation, which can be used as the saliency measure. The normalized Hausdorff distances from the inner pixels to boundary of the superpixels are then tran...
متن کاملSemi-Supervised Affinity Propagation with Instance-Level Constraints
Recently, affinity propagation (AP) was introduced as an unsupervised learning algorithm for exemplar based clustering. Here we extend the AP model to account for semisupervised clustering. AP, which is formulated as inference in a factor-graph, can be naturally extended to account for ‘instancelevel’ constraints: pairs of data points that cannot belong to the same cluster (cannotlink), or must...
متن کامل